Location:
Search - cooley tukey
Search list
Description: 利用经典的Cooley-Tukey基2算法求复序列 的DFT
Platform: |
Size: 2261 |
Author: 张华 |
Hits:
Description: 利用经典的Cooley-Tukey基2算法求复序列x（n）的DFT X（k）
Platform: |
Size: 1145 |
Author: enhom |
Hits:
Description: 利用经典的Cooley-Tukey基2算法求复序列 的DFT
Platform: |
Size: 2048 |
Author: 张华 |
Hits:
Description: 利用经典的Cooley-Tukey基2算法求复序列x（n）的DFT X（k）-Use of the classic Cooley-Tukey radix-2 algorithm for complex sequence x (n) of the DFT X (k)
Platform: |
Size: 1024 |
Author: enhom |
Hits:
Description: 离散傅里叶变换是20世纪60年代是计算复杂性研究的主要里程碑之一，1965年Cooley和Tukey所研究的计算离散傅里叶变换(Discrete Fourier Test)的快速傅氏变换(FFT)将计算量从О(n2)下降至О(nlogn)，推进了FFT更深层、更广法的研究与应用。
这是一个傅氏变换的MPI程序，用C语言实现。-Discrete Fourier Transform of the 20th century 60 s computational complexity is a major milestone in one study, in 1965 Cooley and Tukey studied the calculation of discrete Fourier transform (Discrete Fourier Test) fast Fourier transform (FFT) calculation increased from О (n2) dropped to О (nlogn), the FFT to promote deeper, broader research and application of law. This is a Fourier transform of the MPI process, with C language.
Platform: |
Size: 4096 |
Author: chj |
Hits:
Description: 利用经典的Cooley-Tukey基2算法求复序列的DFT-Use of the classic Cooley-Tukey radix-2 algorithm for complex sequence of DFT
Platform: |
Size: 1024 |
Author: dayuruozhi |
Hits:
Description: 利用经典的COOLEY-TUKEY基2算法求复序列x[n]的DFTX[k].有Fortran的子程序和主程序,还有C程序-The use of classic COOLEY-TUKEY radix-2 algorithm for complex sequence x [n] of DFTX [k]. Have the Fortran subroutines and main program, there are C procedures
Platform: |
Size: 2048 |
Author: 刘建 |
Hits:
Description: This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the source code is more readable and faster than the classical implementation. The efficiency is proved by performance benchmarks on different platforms.
Platform: |
Size: 52224 |
Author: nytza |
Hits:
Description: cmpfft.for（hcmpfft.for）
利用经典的Cooley-Tukey基2算法求复序列 的DFT
-cmpfft.for (hcmpfft.for) to use the classic Cooley-Tukey radix-2 algorithm for the DFT complex sequence
Platform: |
Size: 1024 |
Author: 金茜 |
Hits:
Description: The function implement the 1D sequency(Walsh) ordered fast Walsh-Hadamard transform which can be used in signal processing, pattern recongnition and Genetic alogorithms.
This algorithm uses a Cooley-Tukey type signal flow graph and is implemented in N log2 N additions and subtractions. Data sequence length must be an integer power of 2.
The inverse transform is the same as the forward transform except for the multiplication factor N. This can be easily achieved by deleting the last line i.e. x=inv(N)*x
Example:
x=[1 2 1 1]
W=FWHT(x) -The function implement the 1D sequency(Walsh) ordered fast Walsh-Hadamard transform which can be used in signal processing, pattern recongnition and Genetic alogorithms.
This algorithm uses a Cooley-Tukey type signal flow graph and is implemented in N log2 N additions and subtractions. Data sequence length must be an integer power of 2.
The inverse transform is the same as the forward transform except for the multiplication factor N. This can be easily achieved by deleting the last line i.e. x=inv(N)*x
Example:
x=[1 2 1 1]
W=FWHT(x)
Platform: |
Size: 2048 |
Author: ry |
Hits:
Description: dsp算法40例,包括fft、滤波器、谱运算等
1． 将模拟滤波器转变为数字滤波器。
2． 由得到幅频响应 。
3． 用Burg算法求AR模型的参数。
4． 由AR模型参数得到功率谱。
5． 用Levinson算法求解Yule-Walker方程以得到 阶AR模型的参数 。
6． 实现双线性Z变换。
7． 设计巴特沃斯模拟低通滤波器，求出转移函数 。
8． 设计切比雪夫I型模拟低通滤波器，求出转移函数 。
9． 直接由定义求 点复序列 的DFT 。
10．利用经典的Cooley-Tukey基2算法求复序列 的DFT 。
-dsp algorithms 40 cases, including the fft, filter, spectrum operations, etc.
1. Analog filters into digital filters.
2. Amplitude-frequency response by obtained.
3. Burg algorithm for AR model with the parameters of demand.
4. AR model parameters obtained from the power spectrum.
5. Levinson algorithm using Yule-Walker equations to get the first-order AR model
parameters.
6. The bilinear Z transform to achieve.
7. Design of Butterworth analog low-pass filter, find the transfer function.
8. Design of Chebyshev-I analog low-pass filter, find the transfer function.
9. Directly from the definition of point complex sequence of DFT.
10. The use of the classic Cooley-Tukey radix-2 algorithm is seeking re-sequence of DFT.
.......
Platform: |
Size: 59392 |
Author: jack |
Hits:
Description: 基2快速傅立叶变换
库里-图基算法
基2快速傅立叶变换
库里-图基算法-Radix-2 FFT Cooley-Tukey algorithm
Platform: |
Size: 1024 |
Author: 叶长安 |
Hits:
Description: 本文首先通过分析FFT 的Cooley-Tukey 算法，从而导出相应的IFFT 算法-Firstly, by analyzing the FFT of Cooley-Tukey algorithm, which lead to a corresponding IFFT algorithm
Platform: |
Size: 182272 |
Author: 张勇 |
Hits:
Description: twiddle factor - a part of cooley-tukey algorithm
Platform: |
Size: 1024 |
Author: shimis |
Hits:
Description: FFT旋转因子，旋转因子是蝶形运算的组成部分，是数字信号处理FFT算法的基础部分-FFT twiddle factor, rotation factor is an integral part of the butterfly, digital signal processing is a fundamental part of FFT algorithm
Platform: |
Size: 1024 |
Author: 姚兴波 |
Hits:
Description: Algorithm Cooley Tukey (FFT).
Platform: |
Size: 1024 |
Author: Daniel |
Hits:
Description: a 2k/4k/8k point based fft is designed for OFDM using cooley tukey algorithm
Platform: |
Size: 291840 |
Author: pert |
Hits:
Description: n point fft program which computes the dft of a function using cooley tukey techniques
Platform: |
Size: 1024 |
Author: goldriver92 |
Hits:
Description: Cooley-Tukey for lab work
Platform: |
Size: 1024 |
Author: valeros |
Hits:
Description: cooley tukey algorithm for FFT calculation
Platform: |
Size: 118784 |
Author: amir |
Hits: